Resolution-Based Theorem Proving for SHn-Logics
نویسنده
چکیده
In this paper we illustrate by means of an example, namely SHn-logics, a method for translation to clause form and automated theorem proving for first-order many-valued logics based on distributive lattices with operators.
منابع مشابه
Resolution-Based Theorem Proving for Manyvalued Logics
A general approach to automated theorem proving for all rst-order nite-valued logics that can be deened truth-functionally is described. The suggested proof procedure proceeds in two, largely independent, steps. First, logic-speciic translation calculi are used to generate clause forms for arbitrary formulas of a many-valued logic. The worst-case complexity of the translation rules is analysed ...
متن کاملTheorem-Proving for Discrete Temporal Logic
This chapter considers theorem proving for discrete temporal logics. We are interested in deciding or at least enumerating the formulas of the logic which are valid, that is, are true in all circumstances. Most of the techniques for temporal theorem-proving have been extensions for methods developed for classical logics but completely novel techniques have also been developed. Initially we conc...
متن کاملChaining Techniques for Automated Theorem Proving in Many-Valued Logics
We apply chaining techniques to automated theorem proving in many-valued logics. In particular, we show that superposition specializes to a refined version of the manyvalued resolution rules introduced by Baaz and Fermüller, and that ordered chaining can be specialized to a refutationally complete inference system for regular clauses.
متن کاملDirect Resolution for Modal-like Logics
In this paper we discuss the implementation of a hybrid logic theorem prover based on resolution, HyLoRes, which fuses first-order proving techniques with modal and hybrid reasoning. The focus is on implementation details, and on how we adapted first-order methods to the hybrid environment.
متن کاملUsing Resolution as Decision Procedure
This cumulative habilitation thesis is based on five papers related to resolution decision procedures. Resolution is a well-known technique for first-order theorem proving. It is complete, but it does not terminate in general, when there exists no proof. In many cases, resolution can be modified in such a way that it becomes a decision procedure for certain subclasses of first-order logic. We h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998